Keywords
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Keywords » - entrée « NP hard problem »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
NP complete problem < NP hard problem < NP parser  Facettes :

List of bibliographic references indexed by NP hard problem

Number of relevant bibliographic references: 10.
Ident.Authors (with country if any)Title
002801 (2011) Dilip Datta [Inde, Portugal] ; Andre R. S. Amaral [Portugal] ; Jose Rui Figueira [France]Single row facility layout problem using a permutation-based genetic algorithm
003B67 (2009) A. Bellanger [France] ; A. Oulamara [France]Scheduling hybrid flowshop with parallel batching machines and compatibilities
005416 (2006) Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggernes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France]Optimal Linear Arrangement of Interval Graphs
005592 (2006) Julien Fondrevelle [France] ; Ammar Oulamara [France] ; Marie-Claude Portmann [France]Permutation flowshop scheduling problems with maximal and minimal time lags
006B75 (2004) Phong Q. Nguyen [France] ; Damien Stehlé [France]Low-Dimensional Lattice Basis Reduction Revisited
007B50 (2003) Michaël Rusinowitch [France] ; Mathieu Turuani [France]Protocol insecurity with a finite number of sessions and composed keys is NP-complete
007B77 (2003) N. N. Pisaruk [France]A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
00AA10 (1999) Laurent Juban [France]Dichotomy theorem for the generalized unique satisfiability problem
00C004 (1996) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Unification algorithms cannot be combined in polynomial time
00C816 (1995) J.-M. Gallone [France] ; F. Charpillet [France] ; F. Alexandre [France]Anytime scheduling with neural networks

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i -k "NP hard problem" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i  \
                -Sk "NP hard problem" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    NP hard problem
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022